Routing of individual polymers in designed patterns.
نویسندگان
چکیده
Synthetic polymers are ubiquitous in the modern world, but our ability to exert control over the molecular conformation of individual polymers is very limited. In particular, although the programmable self-assembly of oligonucleotides and proteins into artificial nanostructures has been demonstrated, we currently lack the tools to handle other types of synthetic polymers individually and thus the ability to utilize and study their single-molecule properties. Here we show that synthetic polymer wires containing short oligonucleotides that extend from each repeat can be made to assemble into arbitrary routings. The wires, which can be more than 200 nm in length, are soft and bendable, and the DNA strands allow individual polymers to self-assemble into predesigned routings on both two- and three-dimensional DNA origami templates. The polymers are conjugated and potentially conducting, and could therefore be used to create molecular-scale electronic or optical wires in arbitrary geometries.
منابع مشابه
Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC
For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...
متن کاملNon-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC
For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nature nanotechnology
دوره 10 10 شماره
صفحات -
تاریخ انتشار 2015